Compositional Stochastic Model Checking Probabilistic Automata via Assume-guarantee Reasoning

Assume-Guarantee Model Checking

We present assume-guarantee model checking, a novel technique for verifying correctness properties of loosely-coupled multithreaded software systems. Assume-guarantee model checking verifies each thread of a multithreaded system separately by constraining the actions of other threads with an automatically inferred environment assumption. Separate verification of each thread allows the enumerati...

A Model for Probabilistic Reasoning on Assume/Guarantee Contracts

In this paper, we present a probabilistic adaptation of an Assume/Guarantee contract formalism. For the sake of generality, we assume that the extended state machines used in the contracts and implementations define sets of runs on a given set of variables, that compose by intersection over the common variables. In order to enable probabilistic reasoning, we consider that the contracts dictate ...

Assume-Guarantee Based Compositional Reasoning for Synchronous Timing Diagrams

Compositional and Assume-Guarantee Reasoning for Switching Linear Systems

Modular modeling techniques play an important role in the analysis of engineering processes as well as in control applications. While individual components of aggregated models can be relatively simple, complexity increases significantly when interconnections are considered. To address the problem of complexity explosion, simulation relations can be employed to abstract system behaviors by lowe...

Compositional assume-guarantee reasoning for input/output component theories

We formulate a sound and complete assume-guarantee framework for reasoning compositionally about components modelled as a variant of interface automata. The specification of a component, which expresses both safety and progress properties of input and output interactions with the environment, is characterised by finite traces. The framework supports dynamic reasoning about components and specif...